Pattern Recognition and String Matching
نویسندگان
چکیده
4 String Design 5 4.1 Maximum Distance Code . . . . . . . . . . . . . . . . . . . . . . . . . . 6 4.2 Equidistant code and Bayes rule . . . . . . . . . . . . . . . . . . . . . . 7 4.3 Equidistant code and unbiased distance . . . . . . . . . . . . . . . . . . 7 4.4 Summary of Constraints . . . . . . . . . . . . . . . . . . . . . . . . . . 9 4.5 Code Sensitivity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
منابع مشابه
String Matching and its Applications in Diversified Fields
String searching algorithms, sometimes called string matching algorithms, are an important class of string algorithms that try to find a place where one or several strings (also called patterns) are found within a larger string or text.[11] String matching is a classical problem in computer science. In this paper we are trying to explore the various diversified fields where string matching has ...
متن کاملFace Recognition using Approximate String Matching
String matching algorithm is a very useful algorithm in pattern matching that can be used to match any patterns that can be represented in strings or sequence. This paper will discussed how string matching can be used as a method for face recognition. We will focus on the implementation using approximate string matching. In order for face images to be implemented in pattern matching, they have ...
متن کاملShape recognition using fuzzy string-matching technique
Object recognition is a very important task in industrial applications. Attributed string matching is a well-known technique for pattern matching. The present paper proposes a fuzzy string-matching approach for two-dimensional object recognition. The fuzzy numbers are used to represent the edit costs. Therefore, the edit distances are also presented as fuzzy numbers. The attributed string-match...
متن کاملParametric string matching and its application to pattern recognition
String matching is a useful concept in pattern recognition that is constantly receiving attention from both theoretical and practical points of view. In this paper we propose a generalized version of the string matching algorithm by Wagner and Fischer [1]. It is based on a parametrization of the edit cost. We assume constant cost for any delete and insert operation, but the cost for replacing a...
متن کاملLocal Derivative Pattern with Smart Thresholding: Local Composition Derivative Pattern for Palmprint Matching
Palmprint recognition is a new biometrics system based on physiological characteristics of the palmprint, which includes rich, stable, and unique features such as lines, points, and texture. Texture is one of the most important features extracted from low resolution images. In this paper, a new local descriptor, Local Composition Derivative Pattern (LCDP) is proposed to extract smartly stronger...
متن کامل